Registrations vs Redefinitions in Mizar
نویسنده
چکیده
In this paper we brie y discuss two constructions of the Mizar language rede nitions and registrations. We focus on practical aspects of using them in Mizar texts to be e ectively processed by the Mizar Verifier. We describe situations when rede nitions can be and should be replaced by corresponding registrations.
منابع مشابه
Tarski's Geometry and the Euclidean Plane in Mizar
We discuss the formal approach to Tarski geometry axioms modelled with the help of the Mizar computerized proof assistant system. We try however to go much further from the use of simple predicates in the direction of the use of structures with their inheritance, attributes as a tool of more human-friendly namespaces for axioms, and registrations of clusters to obtain more automation (with the ...
متن کاملTarski Geometry Axioms
This is the translation of the Mizar article containing readable Mizar proofs of some axiomatic geometry theorems formulated by the great Polish mathematician Alfred Tarski [8], and we hope to continue this work. The article is an extension and upgrading of the source code written by the first author with the help of miz3 tool; his primary goal was to use proof checkers to help teach rigorous a...
متن کاملOn Square-Free Numbers
In the article the formal characterization of square-free numbers is shown; in this manner the paper is the continuation of [19]. Essentially, we prepared some lemmas for convenient work with numbers (including the proof that the sequence of prime reciprocals diverges [1]) according to [18] which were absent in the Mizar Mathematical Library. Some of them were expressed in terms of clusters’ re...
متن کاملTopological Interpretation of Rough Sets
Rough sets, developed by Pawlak, are an important model of incomplete or partially known information. In this article, which is essentially a continuation of [11], we characterize rough sets in terms of topological closure and interior, as the approximations have the properties of the Kuratowski operators. We decided to merge topological spaces with tolerance approximation spaces. As a testbed ...
متن کاملFermat's Little Theorem via Divisibility of Newton's Binomial
Solving equations in integers is an important part of the number theory [29]. In many cases it can be conducted by the factorization of equation’s elements, such as the Newton’s binomial. The article introduces several simple formulas, which may facilitate this process. Some of them are taken from relevant books [28], [14]. In the second section of the article, Fermat’s Little Theorem is proved...
متن کامل